Volume 4, Issue 3, pp. 209-396
Please Note: Electronic articles are available well in advance of the printed articles.
Finding a Maximum Cut of a Planar Graph in Polynomial Time
F. Hadlock
pp. 221-225
Complete Register Allocation Problems
Ravi Sethi
pp. 226-248
The Power of Negative Thinking in Multiplying Boolean Matrices
Vaughan R. Pratt
pp. 326-330
Speed of Recognition of Context-Free Languages by Array Automata
S. Rao Kosaraju
pp. 331-340
Optimum Partitions of Tree Addressing Structures
W. H. Hosken
pp. 341-347
On Finding and Updating Spanning Trees and Shortest Paths
P. M. Spira and A. Pan
pp. 375-380
On the Number of Multiplications/Divisions Evaluating a Polynomial with Auxiliary Functions
L. Revah
pp. 381-392
An Algorithm for Determining Whether the Connectivity of a Graph is at Least $k$
Shimon Even
pp. 393-396
